2-Dimensional Cellular Automata Approach for Robot Grid Formations

نویسندگان

  • Ross Mead
  • Jerry B. Weinberg
چکیده

One potentially cost-effective approach to harvesting solar power from space is the use of thousands of individual robots moving in formation, each with a piece of solar panel attached, to form a solar panel array. In previous work, we demonstrated an algorithm that treats a group of robots as a 1-dimensional cellular automaton, which is able to establish formations defined by a single mathematical function. We now extend the algorithm to establish grid formations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Single- and Multi-Dimensional Cellular Automata Approach to Robot Formation Control

One of the challenges to the realization of harvesting solar power from space is overcoming the difficulties and high cost for the transportation and construction of a large orbiting solar reflector. One approach that has received attention is using thousands of individual robots moving in formation, each with a piece of the reflector attached, to form the structure. In previous work, we demons...

متن کامل

A Distributed Control Algorithm for Robots in Grid Formations

In previous work, we demonstrated an algorithm that treats a group of robots as a 1-dimensional cellular automaton, which is able to establish formations defined by a single mathematical function. We now extend the algorithm to establish grid formations.

متن کامل

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

A Novel Cellular Automata Based Real Time Path Planning Method for Mobile Robots

Path planning method for mobile robots based on two dimensional cellular automata is proposed. The method is appropriate for multi-robot problems as well as dynamic environments. In order to develop the planning method, environment of the robot discretized by a rectangular grid and the automata with four states is defined including Robot cell, Free cell and Obstacle cell and Best goal directing...

متن کامل

Autonomously Implemented Versatile Path Planning for Mobile Robots Based on Cellular Automata and Ant Colony

A path planning method for mobile robots based on two dimensional cellular automata is proposed. The method can be applied for environments with both concave and convex obstacles. It is also appropriate for multi-robot problems as well as dynamic environments. In order to develop the planning method, environment of the robot is decomposed to a rectangular grid and the automata is defined with f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008